package com.example.leetcode.graph;

import com.example.leetcode.graph.common.GraphUtils;

class Solution1091 {
    public int shortestPathBinaryMatrix(int[][] grid) {
        return GraphUtils.shortestPathBinaryMatrix(grid);
    }
}

public class leetcode1091 {
    public static void main(String[] args) {
        Solution1091 solution1091 = new Solution1091();
        int[][] grid = {{0, 1}, {1, 0}};
        int[][] grid1 = {{0, 0, 0}, {1, 1, 0}, {1, 1, 0}};
        int[][] grid2 = {{1, 0, 0}, {1, 1, 0}, {1, 1, 0}};
        System.out.println(solution1091.shortestPathBinaryMatrix(grid));
        System.out.println(solution1091.shortestPathBinaryMatrix(grid1));
        System.out.println(solution1091.shortestPathBinaryMatrix(grid2));
    }
}
